A Novel Distributed Clustering Algorithm for Mobile Ad-hoc Networks
نویسندگان
چکیده
منابع مشابه
Clustering Algorithm in Mobile Ad Hoc Networks
In this paper we consider an example of usage of SAT solvers for the problem of sensor placement as a testbed for intelligent algorithms. In particular, we consider a clustering algorithm in mobile ad hoc networks. The problem of sensor placement (SP) received a lot of attention recently (see e.g. [1, 2]). Note that many different formalizations of sensor placement is extensively used for impro...
متن کاملA Merging Clustering Algorithm for Mobile Ad Hoc Networks
Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities and pro...
متن کاملA Novel Optimized Clustering Scheme for Mobile Ad-hoc Networks
In a Mobile Ad-Hoc Network (MANET) hosts communicate with each other without any centralized control. Due to various constraints like scarcity of resources, excessive routing overhead etc, the cluster routing protocol in MANETs becomes less reliable. In this paper, we present an efficient algorithm for cluster formation and selection of optimal clusterhead and thus forming the optimal cluster t...
متن کاملA Distributed Backbone Formation Algorithm for Mobile Ad Hoc Networks
Construction of a backbone architecture is an important issue in mobile ad hoc networks(MANET)s to ease routing and resource management. We propose a new fully distributed algorithm for backbone formation in MANETs that constructs a directed ring architecture. We show the operation of the algorithm, analyze its message complexity and provide results in the simulation environment of ns2. Our res...
متن کاملA distributed mutual exclusion algorithm for mobile ad-hoc networks
A distributed mutual exclusion algorithm based on token exchange and well suited for mobile ad-hoc networks is presented along with a simulation study. The algorithm is based onto a dynamic logical ring and combines the best from the two families of token based algorithms (i.e., tokenasking and circulating token) in order to get a number of messages exchanged per CS access (the main performance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2008
ISSN: 1549-3636
DOI: 10.3844/jcssp.2008.161.166